Discrete Least Square Approximation of Multivariable Functions by Random Sampling Method
نویسندگان
چکیده
منابع مشابه
Approximation of Functions by Multivariable Hermite Basis: A Hybrid Method
In this paper an approximation of multivariable functions by Hermite basis is presented and discussed. Considered here basis is constructed as a product of one-variable Hermite functions with adjustable scaling parameters. The approximation is calculated via hybrid method, the expansion coefficients by using an explicit, non-search formulae, and scaling parameters are determined via a search al...
متن کاملcollocation discrete least square (cdls) method for elasticity problems
a meshless approach, collocation discrete least square (cdls) method, is extended in this paper, for solvingelasticity problems. in the present cdls method, the problem domain is discretized by distributed field nodes. the fieldnodes are used to construct the trial functions. the moving least-squares interpolant is employed to construct the trialfunctions. some collocation points that are indep...
متن کاملVideo Shot Cut Detection Using Least Square Approximation Method
Video shot boundary detection is the basic step in the area of content based video analysis and retrieval. Various automatic shot boundary detection techniques have been proposed and their performances are reliable, especially for video cut detection. However most of the proposed methods are sensitive to camera, object motion and lighting changes. In this paper, we have focused mainly on the im...
متن کاملUniform approximation by discrete least squares polynomials
We study uniform approximation of differentiable or analytic functions of one or several variables on a compact set K by a sequence of discrete least squares polynomials. In particular, if K satisfies a Markov inequality and we use point evaluations on standard discretization grids with the number of points growing polynomially in the degree, these polynomials provide nearly optimal approximant...
متن کاملDiscrete Least Squares Approximation by Trigonometric Polynomials
We present an efficient and reliable algorithm for discrete least squares approximation of a real-valued function given at arbitrary distinct nodes in [0, 2tt) by trigonometric polynomials. The algorithm is based on a scheme for the solution of an inverse eigenproblem for unitary Hessenberg matrices, and requires only O(mn) arithmetic operations as compared with 0(mn ) operations needed for alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 1973
ISSN: 0453-4654
DOI: 10.9746/sicetr1965.9.378